Efficient Large Integers Arithmetic by Adopting Squaring and Complement Recoding Techniques
نویسندگان
چکیده
The efficient squaring algorithm plays an important role in large number arithmetic. All multiplication algorithms can be used for squaring large integers, but their performance can be greatly improved by using the standard squaring algorithm. Complement recoding method can be divided into two groups: 1’s complement recoding method and 2’s complement recoding method. In this paper, we propose an efficient squaring algorithm by combing 1’s complement recoding method with standard squaring algorithm to fast evaluate the squaring. The computational complexity of the proposed squaring method is
منابع مشابه
Efficient arithmetic on ARM-NEON and its application for high-speed RSA implementation
Advanced modern processors support Single Instruction Multiple Data (SIMD) instructions (e.g. Intel-AVX, ARM-NEON) and a massive body of research on vector-parallel implementations of modular arithmetic, which are crucial components for modern public-key cryptography ranging from RSA, ElGamal, DSA and ECC, have been conducted. In this paper, we introduce a novel Double Operand Scanning (DOS) me...
متن کاملSome integer formula-encodings and related algorithms
We investigate the special class of formulas made up of arbitrary but finite combinations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such formulas, we describe two essentially distinct families of canonical formula-encodings for integers, respectively deduced from the decimal encoding and the fund...
متن کاملAn efficient implementation of multi-prime RSA on DSP processor
RSA is a popular cryptography algorithm widely used in signing and encrypting operations for security systems. Generally, the software implementations of RSA algorithm are based on 2-prime RSA. Recently multi-prime RSA has been proposed to speed up RSA implementations. Both 2-prime and multi-prime implementations require squaring reduction and multiplication reduction of multi-precision integer...
متن کاملIssues in Implementation of Public Key Cryptosystems
A new class of moduli called the low-weight polynomial form integers (LWPFIs) is introduced. LWPFIs are expressed in a low-weight, monic polynomial form, p = f(t). While the generalized Mersenne numbers (GMNs) proposed by Solinas allow only powers of two for t, LWPFIs allow any positive integers. In our first proposal of LWPFIs, we limit the coefficients of f(t) to be 0 and ±1, but later we ext...
متن کاملMizar Analysis of Algorithms: Algorithms over Integers1
This paper is a continuation of [5] and concerns if-while algebras over integers. In these algebras the only elementary instructions are assignment instructions. The instruction assigns to a (program) variable a value which is calculated for the current state according to some arithmetic expression. The expression may include variables, constants, and a limited number of arithmetic operations. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007